The Estrada index of unicyclic graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Signless Laplacian Estrada Index of Unicyclic Graphs

‎For a simple graph $G$‎, ‎the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$‎, ‎where $q^{}_1‎, ‎q^{}_2‎, ‎dots‎, ‎q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$‎. ‎In this paper‎, ‎we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...

متن کامل

The Estrada Index of Graphs

Let G be a simple n-vertex graph whose eigenvalues are λ1, . . . , λn. The Estrada index of G is defined as EE(G) = ∑n i=1 e λi . The importance of this topological index extends much further than just pure graph theory. For example, it has been used to quantify the degree of folding of proteins and to measure centrality of complex networks. The talk aims to give an introduction to the Estrada ...

متن کامل

On the Eccentric Connectivity Index of Unicyclic Graphs

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

متن کامل

Bounds of distance Estrada index of graphs

Let λ1, λ2, · · · , λn be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G) = ∑ n i=1 ei . In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given. MSC 2010: 05C12, 15A42.

متن کامل

The Hyper-Zagreb Index of Trees and Unicyclic Graphs

Topological indices are widely used as mathematical tools to analyze different types of graphs emerged in a broad range of applications. The Hyper-Zagreb index (HM) is an important tool because it integrates the first two Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2012

ISSN: 0024-3795

DOI: 10.1016/j.laa.2011.10.020